Strict coherence of conditional rewriting modulo axioms
نویسنده
چکیده
Conditional rewriting modulo axioms with rich types makes specifications and declarative programs very expressive and succinct and is used in all well-known rule-based languages. However, the current foundations of rewriting modulo axioms have focused for the most part on the unconditional and untyped case. The main purpose of this work is to generalize the foundations of rewriting modulo axioms to the conditional order-sorted case. A related goal is to simplify such foundations. In particular, even in the unconditional case, the notion of strict coherence proposed here makes rewriting modulo axioms simpler and easier to understand. Properties of strictly coherent conditional theories, like operational equi-termination of the →R/B and →R,B relations and general conditions for the conditional Church-Rosser property modulo B are also studied.
منابع مشابه
On the Church-Rosser and Coherence Properties of Conditional Order-Sorted Rewrite Theories1
In the effort to bring rewriting-based methods into contact with practical applications both in programing and in formal verification, there is a tension between: (i) expressiveness and generality—so that a wide range of applications can be expressed easily and naturally—, and (ii) support for formal verification, which is harder to get for general and expressive specifications. This paper answ...
متن کاملA Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications
The (ground) Church-Rosser property, together with termination, is essential for an equational specification to have good executability conditions, and also for having a complete agreement between the specification’s initial algebra, mathematical semantics, and its operational semantics by rewriting. Checking this property for expressive specifications that are order-sorted, conditional with po...
متن کاملConstrained narrowing for conditional equational theories modulo axioms
For an unconditional equational theory (Σ, E) whose oriented equations ~ E are confluent and terminating, narrowing provides an E-unification algorithm. This has been generalized by various authors in two directions: (i) by considering unconditional equational theories (Σ, E∪B) where the ~ E are confluent, terminating and coherent modulo axioms B, and (ii) by considering conditional equational ...
متن کاملChurch-Rosser Properties of Weakly Terminating Term Rewriting Systems
The well known Knuth and Bendix completion procedure computes a convergent term rewriting system from a given set of equational axioms. This procedure was extended to handle mixed sets of rules and equations in order to deal with axioms that cannot be used as rules without loosing the required termination property. The developed technique requires the termination property of the rules modulo th...
متن کاملOn Coherence Properties in Team Rewriting Models of Concurrency
This paper introduces a generic and uniform approach to integrate different design languages for distributed systems in verification tools. It is based on Meseguer’s Rewriting Logic, hence transitions between the states of the respective system are modeled as (conditional) term rewriting steps modulo an equational theory. We argue that, for reasons of efficiency, it is intractable to admit arbi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 672 شماره
صفحات -
تاریخ انتشار 2017